A non-interfering selective disassembly sequence for components with geometric constraints

نویسنده

  • RAJIT GADH
چکیده

This paper analyzes the problem of global disassembly of a selected component from a geometrically constrained assembly. The geometric constraints are: (i) spatial constraints due to the three-dimensional geometric interactions between the components in an assembly; and (ii) user-defined constraints, such as grouping of components as subassemblies and directional constraints on component geometry. A new algorithm has been proposed to determine a non-interfering disassembly sequence for a selected component, minimizing the number of simultaneous component removals. The algorithm analyzes both the spatial constraints of the assembly geometry and the user-defined constraints in evaluating the accessibility of components, which is followed by determining the topological disassembly ordering of the components to evaluate an optimal sequence. Preliminary implementation results of the algorithm for a geometrically constrained assembly are presented.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Geometric Disassembly of Multiple Components from an Assembly Using Wave Propagation

This paper analyzes the problem of disassembling multiple selected components from an assembly, defined as selective disassembly, and presents algorithms for efficient disassembly analysis of geometric models. Applications for selective disassembly include assembling, maintenance and recycling. A new approach called ‘Disassembly Wave Propagation’ is proposed to determine a selective disassembly...

متن کامل

Reducing the complexity of geometric selective disassembly

This paper presents an efficient technique for determining a low-cost disassembly sequence suitable to extract a subset of s components from an assembly containing n components, e of which are exterior ( ). The most efficient solution to this so-called geometric selective disassembly problem is the wave propagation algorithm, which is reported to have a computational complexity of . Instead, th...

متن کامل

Geometric abstractions to support disassembly analysis

Determining whether an assembly can be constructed from its components at the design stage potentially reduces downstream assembly problems. This determination can be accomplished by performing a disassembly analysis of the assembly's geometric model. This paper presents two abstractions derived from the assembly's geometric model that can determine the validity of the assembly: (1) the Assembl...

متن کامل

Selective disassembly for virtual prototyping as applied to de-manufacturing

Selective disassembly involves separating a selected set of components from an assembly. Applications for selective disassembly include de-manufacturing (maintenance and recycling), and assembling. This paper presents a new methodology for performing design for selective disassembly analysis on the CAD model of an assembly. The methodology involves the following three steps: (i) identifying the...

متن کامل

Multi-Objective Unrelated Parallel Machines Scheduling with Sequence-Dependent Setup Times and Precedence Constraints

This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001